IDHC: ID-based Hash-Chains for broadcast authentication in wireless networks

نویسندگان

  • Pietro Michiardi
  • Refik Molva
چکیده

This paper presents an authentication scheme (IDHC) based on an original concept that combines a simple form of identity-based cryptography with the Lamport’s keyed hash chain method. In this solution, users contact a key distribution center (KDC) and receive a master authentication ticket M tightly bound to the users’ identity. M is used as a seed to generate a chain of authentication tickets as with Lamport’s keyed hash chain scheme. Our authentication scheme is designed for loosely timesynchronized users and achieves low communication and computation overhead, scales to large number of receivers, and tolerates packet loss. As opposed to other broadcast authentication schemes available in the literature, our solution does not rely on any public key infrastructure and there is no need for public key certificates. Further, there is no need for an organizational structure among users or between users and the KDC. IDHC is particularly suitable for multiple and dynamic sources of broadcast traffic and we provide a challenging application of our scheme that offers peer authentication to secure the on-demand dynamic source routing (DSR) protocol for ad hoc networks. A security analysis, performance evaluation and storage requirements of the IDHC scheme are also provided in the paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Toward an energy efficient PKC-based key management system for wireless sensor networks

Due to wireless nature and hostile environment, providing of security is a critical and vital task in wireless sensor networks (WSNs). It is known that key management is an integral part of a secure network. Unfortunately, in most of the previous methods, security is compromised in favor of reducing energy consumption. Consequently, they lack perfect resilience and are not fit for applications ...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

A TESLA-based mutual authentication protocol for GSM networks

The widespread use of wireless cellular networks has made security an ever increasing concern. GSM is the most popular wireless cellular standard, but security is an issue. The most critical weakness in the GSM protocol is the use of one-way entity authentication, i.e., only the mobile station is authenticated by the network. This creates many security problems including vulnerability against m...

متن کامل

Effective Multi-user Broadcast Authentication in Wireless Sensor Networks

Broadcast authentication is a critical security service in wireless sensor networks (WSNs), as it allows the mobile users of WSNs to broadcast messages to multiple sensor nodes in a secure way. Previous solutions on broadcast authentication are mostly symmetric-key-based solutions such as μTESLA and multilevel μTESLA. These schemes are usually efficient; however, they all suffer from severe ene...

متن کامل

Foundations of Security for Hash Chains

Nodes in ad hoc networks generally transmit data at regular intervals over long periods of time. Recently, ad hoc network nodes have been built that run on little power and have very limited memory. Authentication is a significant challenge in ad hoc networks, even without considering size and power constraints. Expounding on idealized hashing, this paper examines lower bounds for ad hoc broadc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004